________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:34:40
Input Data from:  dataset132.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,16
Average f[i]   :3900
Average g[i,j] :2109,52380952381
Total demand   :17280
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 22
> Selected Move:	8510	1	-1	5	5500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0    >new incumb.: 8510


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 26
> Selected Move:	10470	1	-1	6	11000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0    >new incumb.: 10470


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 30
> Selected Move:	11530	1	-1	4	17000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0    >new incumb.: 11530


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 36
> Selected Move:	11430	3	2	7	18700


> New Y[]: 
	
	 2  3  0  0  1  1  1  4  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 24
> Selected Move:	11430	4	7	4	18800


> New Y[]: 
	
	 2  3  0  0  4  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 24
> Selected Move:	11430	4	4	5	20000


> New Y[]: 
	
	 2  3  0  0  1  4  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 17
> Selected Move:	11430	4	5	6	20000


> New Y[]: 
	
	 2  3  0  0  1  1  4  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 25
> Selected Move:	11230	3	4	9	20000


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 17
> Selected Move:	11230	4	6	5	20000


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 17
> Selected Move:	11230	4	5	7	18700


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 19
> Selected Move:	11230	4	7	9	19400


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 24
> Selected Move:	11230	3	7	4	19400


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 20
> Selected Move:	11230	4	9	4	18800


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 23
> Selected Move:	11230	4	4	5	20000


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 17
> Selected Move:	11230	4	5	6	20000


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 27
> Selected Move:	11070	3	6	3	19800


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 19
> Selected Move:	11220	3	9	7	19800


> New Y[]: 
	
	 2  3  0  4  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 18
> Selected Move:	11220	4	3	4	17800


> New Y[]: 
	
	 2  3  0  1  4  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 27
> Selected Move:	11220	4	4	5	19000


> New Y[]: 
	
	 2  3  0  1  1  4  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 23
> Selected Move:	11220	4	5	7	17700


> New Y[]: 
	
	 2  3  0  1  1  1  0  4  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 27
> Selected Move:	11320	3	7	2	16000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 36
> Selected Move:	11450	1	-1	9	22000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 28
> Selected Move:	11250	3	9	6	21500


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 35
> Selected Move:	11215	3	3	9	23000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 27
> Selected Move:	11230	2	4	-1	17000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 28
> Selected Move:	11300	3	1	8	19400


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 15
> Selected Move:	11300	4	8	5	19300


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 15
> Selected Move:	11300	4	5	6	18900


> New Y[]: 
	
	 2  0  4  0  0  1  3  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 16
> Selected Move:	11300	4	6	9	18500


> New Y[]: 
	
	 2  0  4  0  0  1  1  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 20
> Selected Move:	11223	3	2	7	20200


> New Y[]: 
	
	 2  0  0  0  0  1  1  4  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 15
> Selected Move:	11186	3	7	4	20300


> New Y[]: 
	
	 2  0  0  0  4  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 31 #######################


> Neighbours evaluated; 17
> Selected Move:	11146	4	4	9	20400


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  1  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 32 #######################


> Neighbours evaluated; 17
> Selected Move:	11140	3	6	3	19400


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 33 #######################


> Neighbours evaluated; 17
> Selected Move:	11140	4	4	9	19300


> New Y[]: 
	
	 2  0  0  1  4  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 34 #######################


> Neighbours evaluated; 16
> Selected Move:	11140	3	4	2	17500


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 35 #######################


> Neighbours evaluated; 20
> Selected Move:	11398	1	-1	4	23500


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 36 #######################


> Neighbours evaluated; 14
> Selected Move:	11600	4	9	4	23000


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 37 #######################


> Neighbours evaluated; 19
> Selected Move:	11370	3	3	6	24000


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 38 #######################


> Neighbours evaluated; 17
> Selected Move:	11160	4	4	9	24500


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 39 #######################


> Neighbours evaluated; 18
> Selected Move:	10984	4	9	6	24900


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 40 #######################


> Neighbours evaluated; 12
> Selected Move:	11027	4	2	4	20700


> New Y[]: 
	
	 2  0  0  0  4  1  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 41 #######################


> Neighbours evaluated; 18
> Selected Move:	11063	3	4	7	20600


> New Y[]: 
	
	 2  0  0  0  0  1  3  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 42 #######################


> Neighbours evaluated; 11
> Selected Move:	10900	4	6	5	21000


> New Y[]: 
	
	 2  0  0  0  0  3  1  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 43 #######################


> Neighbours evaluated; 11
> Selected Move:	11140	3	6	3	20000


> New Y[]: 
	
	 2  0  0  1  0  3  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 44 #######################


> Neighbours evaluated; 14
> Selected Move:	11140	4	5	9	19200


> New Y[]: 
	
	 2  0  0  1  0  1  0  4  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 45 #######################


> Neighbours evaluated; 14
> Selected Move:	11140	4	7	9	20000


> New Y[]: 
	
	 2  0  0  1  0  1  0  3  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 46 #######################


> Neighbours evaluated; 13
> Selected Move:	11014	4	9	8	20300


> New Y[]: 
	
	 2  0  0  1  0  1  0  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,425

## ITERATION 47 #######################


> Neighbours evaluated; 13
> Selected Move:	11140	3	7	4	19700


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 48 #######################


> Neighbours evaluated; 16
> Selected Move:	11140	4	8	5	20000


> New Y[]: 
	
	 2  0  0  1  3  4  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 49 #######################


> Neighbours evaluated; 11
> Selected Move:	11097	4	4	5	20100


> New Y[]: 
	
	 2  0  0  1  4  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 50 #######################


> Neighbours evaluated; 14
> Selected Move:	11140	3	4	2	18300


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 51 #######################


> Neighbours evaluated; 15
> Selected Move:	11140	4	5	3	19000


> New Y[]: 
	
	 2  0  4  3  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 52 #######################


> Neighbours evaluated; 14
> Selected Move:	11140	4	3	8	18400


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 53 #######################


> Neighbours evaluated; 18
> Selected Move:	11098	3	2	7	20100


> New Y[]: 
	
	 2  0  0  1  0  1  0  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 54 #######################


> Neighbours evaluated; 15
> Selected Move:	11070	3	8	1	17700


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 55 #######################


> Neighbours evaluated; 23
> Selected Move:	11070	4	7	3	19800


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 56 #######################


> Neighbours evaluated; 17
> Selected Move:	11070	4	3	5	19000


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 57 #######################


> Neighbours evaluated; 18
> Selected Move:	11070	4	5	9	18400


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 58 #######################


> Neighbours evaluated; 22
> Selected Move:	11070	3	7	4	18400


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 59 #######################


> Neighbours evaluated; 22
> Selected Move:	11070	4	9	4	17800


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 60 #######################


> Neighbours evaluated; 24
> Selected Move:	11070	4	4	5	19000


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 61 #######################


> Neighbours evaluated; 26
> Selected Move:	10820	3	9	6	18500


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 62 #######################


> Neighbours evaluated; 26
> Selected Move:	10820	4	5	3	19300


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 63 #######################


> Neighbours evaluated; 22
> Selected Move:	10820	4	3	4	17300


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 64 #######################


> Neighbours evaluated; 24
> Selected Move:	10820	4	4	6	18500


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 65 #######################


> Neighbours evaluated; 25
> Selected Move:	10780	3	3	8	19500


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 66 #######################


> Neighbours evaluated; 28
> Selected Move:	10780	4	6	4	18300


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 67 #######################


> Neighbours evaluated; 26
> Selected Move:	10930	3	4	2	16500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 68 #######################


> Neighbours evaluated; 33
> Selected Move:	10930	1	-1	3	21000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 69 #######################


> Neighbours evaluated; 34
> Selected Move:	11063	3	8	9	21500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 70 #######################


> Neighbours evaluated; 31
> Selected Move:	11070	2	6	-1	16000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 71 #######################


> Neighbours evaluated; 30
> Selected Move:	11028	1	-1	8	21500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 72 #######################


> Neighbours evaluated; 21
> Selected Move:	10935	3	9	4	21500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 73 #######################


> Neighbours evaluated; 32
> Selected Move:	10828	3	3	6	22500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 74 #######################


> Neighbours evaluated; 28
> Selected Move:	10865	3	4	9	22500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 75 #######################


> Neighbours evaluated; 24
> Selected Move:	10880	4	0	5	19000


> New Y[]: 
	
	 0  3  4  0  0  2  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 76 #######################


> Neighbours evaluated; 24
> Selected Move:	10880	4	5	6	19300


> New Y[]: 
	
	 0  3  4  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 77 #######################


> Neighbours evaluated; 22
> Selected Move:	10880	4	6	8	18600


> New Y[]: 
	
	 0  3  4  0  0  1  1  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 78 #######################


> Neighbours evaluated; 21
> Selected Move:	10880	4	8	9	18800


> New Y[]: 
	
	 0  3  4  0  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 79 #######################


> Neighbours evaluated; 25
> Selected Move:	10830	3	9	4	18900


> New Y[]: 
	
	 0  3  4  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 80 #######################


> Neighbours evaluated; 21
> Selected Move:	10830	4	4	5	19000


> New Y[]: 
	
	 0  3  4  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 81 #######################


> Neighbours evaluated; 21
> Selected Move:	10830	4	5	6	19300


> New Y[]: 
	
	 0  3  4  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 82 #######################


> Neighbours evaluated; 20
> Selected Move:	10830	4	6	8	18600


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 83 #######################


> Neighbours evaluated; 20
> Selected Move:	10630	3	2	7	20300


> New Y[]: 
	
	 0  3  0  0  1  1  1  4  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 84 #######################


> Neighbours evaluated; 19
> Selected Move:	10781	3	4	9	20300


> New Y[]: 
	
	 0  3  0  0  0  1  1  4  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,325

## ITERATION 85 #######################


> Neighbours evaluated; 19
> Selected Move:	10750	3	7	4	20400


> New Y[]: 
	
	 0  3  0  0  4  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 86 #######################


> Neighbours evaluated; 21
> Selected Move:	10720	3	6	3	19400


> New Y[]: 
	
	 0  3  0  1  4  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 87 #######################


> Neighbours evaluated; 21
> Selected Move:	10720	4	4	9	20000


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 88 #######################


> Neighbours evaluated; 21
> Selected Move:	10720	3	4	7	20000


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  2  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,305

## ITERATION 89 #######################


> Neighbours evaluated; 19
> Selected Move:	10720	4	8	7	19500


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 90 #######################


> Neighbours evaluated; 20
> Selected Move:	10730	3	3	6	20500


> New Y[]: 
	
	 0  3  0  0  0  1  1  2  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 91 #######################


> Neighbours evaluated; 22
> Selected Move:	10733	4	7	9	20500


> New Y[]: 
	
	 0  3  0  0  0  1  1  4  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 92 #######################


> Neighbours evaluated; 18
> Selected Move:	10720	3	6	3	19500


> New Y[]: 
	
	 0  3  0  1  0  1  0  4  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,305

## ITERATION 93 #######################


> Neighbours evaluated; 20
> Selected Move:	10720	4	9	5	19700


> New Y[]: 
	
	 0  3  0  1  0  2  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 94 #######################


> Neighbours evaluated; 21
> Selected Move:	10720	4	5	8	19300


> New Y[]: 
	
	 0  3  0  1  0  1  0  4  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 95 #######################


> Neighbours evaluated; 17
> Selected Move:	10720	4	7	8	19800


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 96 #######################


> Neighbours evaluated; 19
> Selected Move:	10691	4	8	5	20100


> New Y[]: 
	
	 0  3  0  1  0  4  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 97 #######################


> Neighbours evaluated; 18
> Selected Move:	10567	3	3	6	21100


> New Y[]: 
	
	 0  3  0  0  0  4  1  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 98 #######################


> Neighbours evaluated; 20
> Selected Move:	10684	4	5	7	20700


> New Y[]: 
	
	 0  3  0  0  0  2  1  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 99 #######################


> Neighbours evaluated; 17
> Selected Move:	10652	3	7	4	20800


> New Y[]: 
	
	 0  3  0  0  4  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 100 #######################


> Neighbours evaluated; 22
> Selected Move:	10720	3	6	3	19800


> New Y[]: 
	
	 0  3  0  1  4  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,295

## ITERATION 101 #######################


> Neighbours evaluated; 19
> Selected Move:	10720	4	5	9	19600


> New Y[]: 
	
	 0  3  0  1  4  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 102 #######################


> Neighbours evaluated; 20
> Selected Move:	10720	3	4	2	17800


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 103 #######################


> Neighbours evaluated; 23
> Selected Move:	10817	1	-1	4	23800


> New Y[]: 
	
	 0  3  4  1  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 104 #######################


> Neighbours evaluated; 22
> Selected Move:	10856	4	9	8	23600


> New Y[]: 
	
	 0  3  4  1  1  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,295

## ITERATION 105 #######################


> Neighbours evaluated; 21
> Selected Move:	10750	4	8	4	23900


> New Y[]: 
	
	 0  3  4  1  2  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,3

## ITERATION 106 #######################


> Neighbours evaluated; 22
> Selected Move:	10700	4	4	5	24000


> New Y[]: 
	
	 0  3  4  1  1  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 107 #######################


> Neighbours evaluated; 22
> Selected Move:	10720	2	4	-1	18000


> New Y[]: 
	
	 0  3  4  1  0  2  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 108 #######################


> Neighbours evaluated; 21
> Selected Move:	10720	4	5	3	19500


> New Y[]: 
	
	 0  3  4  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 109 #######################


> Neighbours evaluated; 22
> Selected Move:	10720	4	3	8	17600


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 110 #######################


> Neighbours evaluated; 19
> Selected Move:	10650	3	1	4	19100


> New Y[]: 
	
	 0  0  4  1  3  1  0  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 111 #######################


> Neighbours evaluated; 15
> Selected Move:	10780	3	3	6	20100


> New Y[]: 
	
	 0  0  4  0  3  1  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 112 #######################


> Neighbours evaluated; 15
> Selected Move:	10810	3	8	0	18500


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 113 #######################


> Neighbours evaluated; 21
> Selected Move:	11080	3	2	8	20700


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 114 #######################


> Neighbours evaluated; 16
> Selected Move:	10980	4	8	5	21000


> New Y[]: 
	
	 2  0  0  0  3  4  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 115 #######################


> Neighbours evaluated; 14
> Selected Move:	10975	4	5	6	21000


> New Y[]: 
	
	 2  0  0  0  3  1  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 116 #######################


> Neighbours evaluated; 17
> Selected Move:	10960	3	6	2	18500


> New Y[]: 
	
	 2  0  4  0  3  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 117 #######################


> Neighbours evaluated; 21
> Selected Move:	10960	4	4	5	19800


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 118 #######################


> Neighbours evaluated; 16
> Selected Move:	11334	1	-1	3	24300


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 119 #######################


> Neighbours evaluated; 17
> Selected Move:	11280	4	5	8	24400


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 120 #######################


> Neighbours evaluated; 15
> Selected Move:	11088	3	3	6	25400


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 121 #######################


> Neighbours evaluated; 13
> Selected Move:	11095	4	8	5	25300


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 122 #######################


> Neighbours evaluated; 13
> Selected Move:	10926	4	2	4	21100


> New Y[]: 
	
	 2  0  0  0  4  3  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 123 #######################


> Neighbours evaluated; 14
> Selected Move:	10886	4	5	8	21200


> New Y[]: 
	
	 2  0  0  0  4  1  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 124 #######################


> Neighbours evaluated; 14
> Selected Move:	11070	3	6	3	20200


> New Y[]: 
	
	 2  0  0  1  4  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 125 #######################


> Neighbours evaluated; 13
> Selected Move:	10856	4	4	9	20800


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  3  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 126 #######################


> Neighbours evaluated; 13
> Selected Move:	11068	4	8	9	20200


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  4  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 127 #######################


> Neighbours evaluated; 14
> Selected Move:	11067	3	4	7	20200


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  4  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,37

## ITERATION 128 #######################


> Neighbours evaluated; 12
> Selected Move:	10955	4	8	5	20500


> New Y[]: 
	
	 2  0  0  1  0  4  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 129 #######################


> Neighbours evaluated; 14
> Selected Move:	10953	3	7	4	20500


> New Y[]: 
	
	 2  0  0  1  1  4  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 130 #######################


> Neighbours evaluated; 14
> Selected Move:	10874	4	5	9	20700


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 131 #######################


> Neighbours evaluated; 14
> Selected Move:	10871	3	4	7	20700


> New Y[]: 
	
	 2  0  0  1  0  3  0  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,39

## ITERATION 132 #######################


> Neighbours evaluated; 11
> Selected Move:	10828	4	5	8	20800


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  3  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 133 #######################


> Neighbours evaluated; 12
> Selected Move:	10589	3	3	6	21800


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  3  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 134 #######################


> Neighbours evaluated; 11
> Selected Move:	10900	4	8	7	21000


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 135 #######################


> Neighbours evaluated; 14
> Selected Move:	10774	4	7	6	21300


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 136 #######################


> Neighbours evaluated; 15
> Selected Move:	10767	3	7	4	21300


> New Y[]: 
	
	 2  0  0  0  1  1  3  0  1  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 137 #######################


> Neighbours evaluated; 18
> Selected Move:	10678	4	6	9	21500


> New Y[]: 
	
	 2  0  0  0  1  1  4  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 138 #######################


> Neighbours evaluated; 12
> Selected Move:	10960	3	6	2	19000


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 139 #######################


> Neighbours evaluated; 17
> Selected Move:	10960	4	9	8	19900


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 140 #######################


> Neighbours evaluated; 21
> Selected Move:	10810	3	8	6	19400


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 141 #######################


> Neighbours evaluated; 23
> Selected Move:	10810	4	6	5	19800


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 142 #######################


> Neighbours evaluated; 22
> Selected Move:	10810	4	5	9	19000


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 143 #######################


> Neighbours evaluated; 21
> Selected Move:	10766	3	2	8	21200


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  4  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 144 #######################


> Neighbours evaluated; 14
> Selected Move:	10780	3	9	1	19200


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 145 #######################


> Neighbours evaluated; 24
> Selected Move:	10780	4	8	5	19500


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 146 #######################


> Neighbours evaluated; 28
> Selected Move:	10720	3	4	7	19500


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 147 #######################


> Neighbours evaluated; 25
> Selected Move:	10720	4	5	6	19500


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 148 #######################


> Neighbours evaluated; 24
> Selected Move:	10720	4	6	7	18200


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 149 #######################


> Neighbours evaluated; 22
> Selected Move:	10720	4	7	8	19200


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,42

## ITERATION 150 #######################


> Neighbours evaluated; 25
> Selected Move:	10796	3	1	9	21200


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  4  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 151 #######################


> Neighbours evaluated; 11
> Selected Move:	10761	4	9	7	21300


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 152 #######################


> Neighbours evaluated; 13
> Selected Move:	10849	4	7	8	21100


> New Y[]: 
	
	 2  0  0  0  0  1  1  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 153 #######################


> Neighbours evaluated; 11
> Selected Move:	10328	4	7	5	22400


> New Y[]: 
	
	 2  0  0  0  0  4  1  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 154 #######################


> Neighbours evaluated; 14
> Selected Move:	10700	4	8	9	21500


> New Y[]: 
	
	 2  0  0  0  0  4  1  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 155 #######################


> Neighbours evaluated; 11
> Selected Move:	10693	4	5	6	21500


> New Y[]: 
	
	 2  0  0  0  0  1  4  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 156 #######################


> Neighbours evaluated; 10
> Selected Move:	10644	4	9	7	21600


> New Y[]: 
	
	 2  0  0  0  0  1  4  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 157 #######################


> Neighbours evaluated; 12
> Selected Move:	10636	4	6	5	21600


> New Y[]: 
	
	 2  0  0  0  0  4  1  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 158 #######################


> Neighbours evaluated; 11
> Selected Move:	10888	3	6	3	20600


> New Y[]: 
	
	 2  0  0  1  0  4  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,425

## ITERATION 159 #######################


> Neighbours evaluated; 13
> Selected Move:	10545	4	5	3	21400


> New Y[]: 
	
	 2  0  0  4  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,43

## ITERATION 160 #######################


> Neighbours evaluated; 9
> Selected Move:	10839	4	3	7	20700


> New Y[]: 
	
	 2  0  0  3  0  1  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 161 #######################


> Neighbours evaluated; 13
> Selected Move:	10792	3	7	4	20800


> New Y[]: 
	
	 2  0  0  3  4  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 162 #######################


> Neighbours evaluated; 13
> Selected Move:	10788	4	3	4	20800


> New Y[]: 
	
	 2  0  0  4  3  1  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 163 #######################


> Neighbours evaluated; 14
> Selected Move:	10562	4	4	9	21300


> New Y[]: 
	
	 2  0  0  4  1  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 164 #######################


> Neighbours evaluated; 13
> Selected Move:	10570	3	9	1	19300


> New Y[]: 
	
	 2  3  0  4  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 165 #######################


> Neighbours evaluated; 25
> Selected Move:	10570	4	3	4	17300


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 166 #######################


> Neighbours evaluated; 24
> Selected Move:	10720	3	4	2	15500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 167 #######################


> Neighbours evaluated; 29
> Selected Move:	10820	3	8	6	15500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 168 #######################


> Neighbours evaluated; 28
> Selected Move:	10610	3	2	7	17200


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 169 #######################


> Neighbours evaluated; 23
> Selected Move:	10610	4	7	3	19300


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,47

## ITERATION 170 #######################


> Neighbours evaluated; 18
> Selected Move:	10610	4	3	5	18500


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,465

## ITERATION 171 #######################


> Neighbours evaluated; 21
> Selected Move:	10610	4	5	6	18500


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 172 #######################


> Neighbours evaluated; 23
> Selected Move:	10510	3	6	8	18200


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 173 #######################


> Neighbours evaluated; 27
> Selected Move:	10570	3	7	4	18200


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  4  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 174 #######################


> Neighbours evaluated; 23
> Selected Move:	10570	4	8	5	18500


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 175 #######################


> Neighbours evaluated; 25
> Selected Move:	10510	3	4	7	18500


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 176 #######################


> Neighbours evaluated; 23
> Selected Move:	10510	4	5	3	19300


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 177 #######################


> Neighbours evaluated; 23
> Selected Move:	10575	3	1	9	21300


> New Y[]: 
	
	 2  0  0  4  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,43

## ITERATION 178 #######################


> Neighbours evaluated; 11
> Selected Move:	10538	4	3	9	21400


> New Y[]: 
	
	 2  0  0  3  0  1  0  1  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,425

## ITERATION 179 #######################


> Neighbours evaluated; 13
> Selected Move:	10545	3	7	4	21400


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 180 #######################


> Neighbours evaluated; 13
> Selected Move:	10426	4	9	8	21700


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 181 #######################


> Neighbours evaluated; 13
> Selected Move:	10725	4	3	5	21000


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  4  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 182 #######################


> Neighbours evaluated; 14
> Selected Move:	10720	3	4	7	21000


> New Y[]: 
	
	 2  0  0  1  0  3  0  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,425

## ITERATION 183 #######################


> Neighbours evaluated; 13
> Selected Move:	10545	4	5	8	21400


> New Y[]: 
	
	 2  0  0  1  0  4  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,43

## ITERATION 184 #######################


> Neighbours evaluated; 12
> Selected Move:	10538	3	7	4	21400


> New Y[]: 
	
	 2  0  0  1  1  4  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 185 #######################


> Neighbours evaluated; 13
> Selected Move:	10310	3	5	2	18900


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 186 #######################


> Neighbours evaluated; 13
> Selected Move:	10650	3	8	5	18800


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 187 #######################


> Neighbours evaluated; 24
> Selected Move:	10650	4	5	3	19500


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 188 #######################


> Neighbours evaluated; 22
> Selected Move:	10650	4	3	4	17500


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 189 #######################


> Neighbours evaluated; 20
> Selected Move:	10650	4	4	9	18000


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 190 #######################


> Neighbours evaluated; 21
> Selected Move:	10650	3	0	8	19600


> New Y[]: 
	
	 0  0  4  1  1  1  0  0  2  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 191 #######################


> Neighbours evaluated; 16
> Selected Move:	10650	4	8	4	19900


> New Y[]: 
	
	 0  0  4  1  2  1  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 192 #######################


> Neighbours evaluated; 15
> Selected Move:	10650	4	4	5	20000


> New Y[]: 
	
	 0  0  4  1  1  2  0  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 193 #######################


> Neighbours evaluated; 15
> Selected Move:	10650	4	9	4	19500


> New Y[]: 
	
	 0  0  4  1  3  2  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 194 #######################


> Neighbours evaluated; 13
> Selected Move:	10650	4	5	9	19300


> New Y[]: 
	
	 0  0  4  1  3  1  0  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 195 #######################


> Neighbours evaluated; 12
> Selected Move:	10680	3	3	6	20300


> New Y[]: 
	
	 0  0  4  0  3  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 196 #######################


> Neighbours evaluated; 13
> Selected Move:	10595	4	9	5	20500


> New Y[]: 
	
	 0  0  4  0  3  2  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 197 #######################


> Neighbours evaluated; 13
> Selected Move:	10520	3	5	0	18500


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 198 #######################


> Neighbours evaluated; 10
> Selected Move:	10520	4	4	6	19400


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 199 #######################


> Neighbours evaluated; 11
> Selected Move:	10520	4	6	8	19900


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,41

## ITERATION 200 #######################


> Neighbours evaluated; 11
> Selected Move:	10520	4	8	9	19000


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,405

## ITERATION 201 #######################


> Neighbours evaluated; 11
> Selected Move:	10693	3	2	5	21500


> New Y[]: 
	
	 2  0  0  0  1  4  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 202 #######################


> Neighbours evaluated; 12
> Selected Move:	10620	4	5	9	21700


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  4 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0 
 > pw :0,395
________________________________________________________________

Best solution found: 11530
Run Termination time: 31.01.2010 10:35:21
Run duration: 00:00:40.8437500
________________________________________________________________
